Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform
نویسندگان
چکیده
منابع مشابه
Robust Sparse Walsh-Hadamard Transform: The SPRIGHT Algorithm
We consider the problem of stably computing the K-sparse N -point Walsh-Hadamard Transform (WHT) of a noisy input vector of length N , where K = O(N δ) scales sub-linearly in the signal dimension N for some δ ∈ (0, 1). The most efficient way known by far for computing the WHT of an arbitraryN -length signal is the Fast Walsh-Hadamard Transform (FWHT), which usesN samples and O(N logN) operation...
متن کاملCache conscious Walsh-Hadamard transform
The Walsh-Hadamard Transform (WHT) is an important algorithmin signal processing because of its simplicity. However, in computing large size WHT, non-unit stride access results in poor cache performance leading to severe degradation in performance. This poor cache performance is also a critical problem in achieving high performance in other large size signal transforms. In this paper, we develo...
متن کاملIn search of the optimal Walsh-Hadamard transform
This paper describes an approach to implementing and optimizing fast signal transforms. Algorithms for computing signal transforms are expressed by symbolic expressions, which can be automatically generated and translated into programs. Optimizing an implementation involves searching for the fastest program obtained from one of the possible expressions. In this paper we apply this methodology t...
متن کاملAlgorithm of Walsh - Hadamard Transform with Optical Approach ⋆
In this paper, the fast algorithm to Walsh-Hadamard transform (WHT) is studied from the point of view of the optical computation. Firstly, MSD addition and butterfly calculation in discrete WHT are presented in detail. Then the design and implementation scheme of fast algorithm of WHT is proposed and the software simulations to fast WHT are carried out optically. Meanwhile, the computational co...
متن کامل(Nearly) Sample-Optimal Sparse Fourier Transform
We consider the problem of computing a k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. Our main result is a randomized algorithm that computes such an approximation using O(k log n(log log n)) signal samples in time O(k log n(log log n)), assuming that the entries of the signal are polynomially bounded. The sampling complexity improves over the recent bound ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2017
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3029050